A zero-free interval for chromatic polynomials of graphs with 3-leaf spanning trees
نویسندگان
چکیده
منابع مشابه
A zero-free interval for chromatic polynomials
Woodall, D.R., A zero-free interval for chromatic polynomials, Discrete Mathematics 101 (1992) 333-341. It is proved that, for a wide class of near-triangulations of the plane, the chromatic polynomial has no zeros between 2 and 2.5. Together with a previously known result, this shows that the zero of the chromatic polynomial of the octahedron at 2.546602. . . is the smallest non-integer real z...
متن کاملA Zero-Free Interval for Chromatic Polynomials of Nearly 3-Connected Plane Graphs
Let G = (V,E) be a 2-connected plane graph on n vertices with outer face C such that every 2-vertex cut of G contains at least one vertex of C. Let PG(q) denote the chromatic polynomial of G. We show that (−1)nPG(q) > 0 for all 1 < q ≤ 1.2040.... This result is a corollary of a more general result that (−1)ZG(q,w) > 0 for all 1 < q ≤ 1.2040..., where ZG(q,w) is the multivariate Tutte polynomial...
متن کاملA zero-free interval for flow polynomials of cubic graphs
Let P(G, t) and F(G, t) denote the chromatic and flow polynomials of a graph G. D.R. Woodall has shown that, if G is a plane triangulation, then the only zeros of P(G, t) in (−∞,γ) are 0, 1 and 2, where γ ≈ 2.54 . . . is the zero in (2,3) of the chromatic polynomial of the octahedron. The main purpose of this paper is to remove the planarity hypothesis from Woodall’s theorem by showing that the...
متن کاملChromatic Harmonic Indices and Chromatic Harmonic Polynomials of Certain Graphs
In the main this paper introduces the concept of chromatic harmonic polynomials denoted, $H^chi(G,x)$ and chromatic harmonic indices denoted, $H^chi(G)$ of a graph $G$. The new concept is then applied to finding explicit formula for the minimum (maximum) chromatic harmonic polynomials and the minimum (maximum) chromatic harmonic index of certain graphs. It is also applied to split graphs and ce...
متن کاملNUMBER OF SPANNING TREES FOR DIFFERENT PRODUCT GRAPHS
In this paper simple formulae are derived for calculating the number of spanning trees of different product graphs. The products considered in here consists of Cartesian, strong Cartesian, direct, Lexicographic and double graph. For this purpose, the Laplacian matrices of these product graphs are used. Form some of these products simple formulae are derived and whenever direct formulation was n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2016
ISSN: 0012-365X
DOI: 10.1016/j.disc.2016.05.009